77 research outputs found

    Trip-Based Public Transit Routing

    Get PDF
    We study the problem of computing all Pareto-optimal journeys in a public transit network regarding the two criteria of arrival time and number of transfers taken. We take a novel approach, focusing on trips and transfers between them, allowing fine-grained modeling. Our experiments on the metropolitan network of London show that the algorithm computes full 24-hour profiles in 70 ms after a preprocessing phase of 30 s, allowing fast queries in dynamic scenarios.Comment: Minor corrections, no substantial changes. To be presented at ESA 201

    A case study in hexahedral mesh generation: Simulation of the human mandible

    Get PDF
    We provide a case study for the generation of pure hexahedral meshes for the numerical simulation of physiological stress scenarios of the human mandible. Due to its complex and very detailed free-form geometry, the mandible model is very demanding. This test case is used as a running example to demonstrate the applicability of a combinatorial approach for the generation of hexahedral meshes by means of successive dual cycle eliminations, which has been proposed by the second author in previous work. We report on the progress and recent advances of the cycle elimination scheme. The given input data, a surface triangulation obtained from computed tomography data, requires a substantial mesh reduction and a suitable conversion into a quadrilateral surface mesh as a first step, for which we use mesh clustering and b-matching techniques. Several strategies for improved cycle elimination orders are proposed. They lead to a significant reduction in the mesh size and a better structural quality. Based on the resulting combinatorial meshes, gradient-based optimized smoothing with the condition number of the Jacobian matrix as objective together with mesh untangling techniques yielded embeddings of a satisfactory quality. To test our hexahedral meshes for the mandible model within an FEM simulation we used the scenario of a bite on a ‘hard nut.’ Our simulation results are in good agreement with observations from biomechanical experiments

    Colored Non-Crossing Euclidean Steiner Forest

    Full text link
    Given a set of kk-colored points in the plane, we consider the problem of finding kk trees such that each tree connects all points of one color class, no two trees cross, and the total edge length of the trees is minimized. For k=1k=1, this is the well-known Euclidean Steiner tree problem. For general kk, a kρk\rho-approximation algorithm is known, where ρ1.21\rho \le 1.21 is the Steiner ratio. We present a PTAS for k=2k=2, a (5/3+ε)(5/3+\varepsilon)-approximation algorithm for k=3k=3, and two approximation algorithms for general~kk, with ratios O(nlogk)O(\sqrt n \log k) and k+εk+\varepsilon

    Phase Synchronization in Railway Timetables

    Full text link
    Timetable construction belongs to the most important optimization problems in public transport. Finding optimal or near-optimal timetables under the subsidiary conditions of minimizing travel times and other criteria is a targeted contribution to the functioning of public transport. In addition to efficiency (given, e.g., by minimal average travel times), a significant feature of a timetable is its robustness against delay propagation. Here we study the balance of efficiency and robustness in long-distance railway timetables (in particular the current long-distance railway timetable in Germany) from the perspective of synchronization, exploiting the fact that a major part of the trains run nearly periodically. We find that synchronization is highest at intermediate-sized stations. We argue that this synchronization perspective opens a new avenue towards an understanding of railway timetables by representing them as spatio-temporal phase patterns. Robustness and efficiency can then be viewed as properties of this phase pattern

    Ferredoxin 1b (Fdx1b) Is the essential mitochondrial redox partner for cortisol biosynthesis in zebrafish

    Get PDF
    Mitochondrial cytochrome P450 (CYP) enzymes rely on electron transfer from the redox partner ferredoxin 1 (FDX1) for catalytic activity. Key steps in steroidogenesis require mitochondrial CYP enzymes and FDX1. Over 30 ferredoxin mutations have been explored in vitro; however, no spontaneously occurring mutations have been identified in humans leaving the impact of FDX1 on steroidogenesis in the whole organism largely unknown. Zebrafish are an important model to study human steroidogenesis, because they have similar steroid products and endocrine tissues. This study aimed to characterize the influence of ferredoxin on steroidogenic capacity in vivo by using zebrafish. Zebrafish have duplicate ferredoxin paralogs: fdx1 and fdx1b. Although fdx1 was observed throughout development and in most tissues, fdx1b was expressed after development of the zebrafish interrenal gland (counterpart to the mammalian adrenal gland). Additionally, fdx1b was restricted to adult steroidogenic tissues, such as the interrenal, gonads, and brain, suggesting that fdx1b was interacting with steroidogenic CYP enzymes. By using transcription activator-like effector nucleases, we generated fdx1b mutant zebrafish lines. Larvae with genetic disruption of fdx1b were morphologically inconspicuous. However, steroid hormone analysis by liquid chromatography tandem mass spectrometry revealed fdx1b mutants failed to synthesize glucocorticoids. Additionally, these mutants had an up-regulation of the hypothalamus-pituitary-interrenal axis and showed altered dark-light adaptation, suggesting impaired cortisol signaling. Antisense morpholino knockdown confirmed Fdx1b is required for de novo cortisol biosynthesis. In summary, by using zebrafish, we generated a ferredoxin knockout model system, which demonstrates for the first time the impact of mitochondrial redox regulation on glucocorticoid biosynthesis in vivo
    corecore